搜索资源列表
Rabin-Miller
- 素性检验,可用于小数据,大量数据不支持啊,谢谢使用
miller
- 对Miller-Rabin算法的进一步改进,速度约为0.4秒验证一个素数(CPU为赛扬1.5G) //本程序使用Miller Rabin方法计算1024位素数(2进制)
sxjc
- 应用加密算法和认证技术 实验:Solovag-Strassen算法、Lehmann算法和Rabin-Miller算法的素性检测的原理与测试过程。
数论
- 64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation
Rabin-Miller.rar
- 1.Rabin-Miller算法的素性检测的原理与测试过程。 2. 有算法流程,用程序设计语言将算法过程编程实现。 3. 对输入的随机数,选择素性检测算法进行素性检测。 ,1.Rabin-Miller primality testing algorithm principle and the testing process. 2. There are algorithms process programming language with the process of programm
ss
- 很多密码算法都要随机选择一个大素数,这个是密码学中的MILLER-RABIN算法,判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
PrimeGenAndTester
- Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography. Program has easily readable and
MillerRabin
- 密码学中的Miller Rabin素性检测算法。人工编写,用这个来学习或者是交作业,绝对是过关利器。-Cryptography Miller Rabin primality testing algorithm. Artificial preparation, use this to learn or交作业is definitely a sharp object boundary.
xm1099
- Miller-Rabin随机性素数测试,能有效的判断一个小于2^63次方的数是不是素数。-Miller-Rabin prime randomness tests, can effectively determine whether a power of less than 2 ^ 63 is the number of prime numbers.
MillerRabin
- Miller rabin素性检测算法源代码-Miller R
RSAUpper
- 这是个很容易且广泛使用的简单算法,它基于Gary Miller的部分象法,有Michael Rabin发展。事实上,这是在NIST的DSS建议中推荐的算法的一个简化版。 首先选择一个代测的随机数p,计算b,b是2整除p-1的次数。然后计算m,使得n=1+(2^b)m。-This is a very easy and simple and widely used algorithm, which is based on some of Gary Miller as the law, ther
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
MillerR
- Miller-Rabin test for simple numbers.
Miller-Rabin
- Miller-Rabin算法 随机算法 求素数-Miller-Rabin Ramdom Algorithm
suxingjiance
- 素性检测,利用三种方法: Solovag-Strassen检测,Lehmam检测, Rabin-Miller检测-Primality testing, using three methods: Solovag-Strassen Detection, Lehmam testing, Rabin-Miller Detection
rk
- Rabin-Karp algorithm
Miller-Rabin
- 用Witness2实现Miller-Rabin算法,主程序循环5—20次,看在100,000—200,000之间有多少个数被判为素数-With the Miller-Rabin algorithm to achieve Witness2, the main program loop 5-20 times, to see how many in number between 100,000-200,000 convicted of prime
Miller-Rabin_primality_test_(Java)
- Miller rabin primality test
miller
- 64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解 -64 within the Rabin-Miller strong pseudo-primes test and Pollard rho factorization
rabin-miller
- rabin-miller算法测大素数,采用费马小定理和二次探测法